import java.util.Scanner;

public class Test implements Cloneable{
    public static void main(String[] args) {
        boolean b = true ? false : true == true ? false : true;
        System.out.println(b);
    }
    public static void main2(String[] args) {
        String s = "BAabB";
        String s1 = setstring(s);
        System.out.println(s1);
    }
    public static String setstring (String str) {
        String newStr = "";
        // write code here
        //其实就是对字符串进行去重
        //利用哈希表
        int[] hash = new int[100];
        for (int i = 0; i < str.length(); i++) {
            //先判断是大写还是小写
            char s = str.charAt(i);
            if (s >= 'A' && s <= 'B') {
                hash[s - 'A' + 26]++;
            } else {
                hash[s - 'a']++;
            }

        }
        for (int i = 0; i < str.length(); i++) {
            char s = str.charAt(i);
            String newString = s + "";

            //判断大小写
            if (s >= 'A' && s <= 'B') {
                if (hash[s - 'A' + 26] >= 1) {
                    //此时就相当于出现了该字符
                    //拼接该字符
                    newStr = newStr + newString;
                    //之后将其置为0
                    hash[s - 'A' + 26] = 0;
                }
            } else {
                if (hash[s - 'a'] >= 1) {
                    newStr = newStr + newString;
                    hash[s - 'a'] = 0;
                }
            }
            /*if (hash[n + 26] >= 1) {
                //此时就相当于出现了该字符
                //拼接该字符
                newStr = newStr + newString;
                //之后将其置为0
                hash[n + 26] = 0;
            } else if (hash[s - 'a'] >= 1) {
                newStr = newStr + newString;
                hash[s - 'a'] = 0;
             }*/
        }
        return newStr;
    }
    public static void main1(String[] args) {
        int[] ar1 = {1,2,3};
        int[] ar2 = {1,3,5};
        merge(ar1,ar1.length,ar2,ar2.length);
        /*for (int i = 0; i < ar1.length; i++) {
            System.out.print(ar1[i] + " ");
        }*/

    }
    public static void merge (int A[], int m, int B[], int n) {
        //创建一个临时数组
        int[] tmp = new int[m + n];
        //使用归并排序
        //定义双指针
        int i = 0;
        int j = 0;
        int pos = 0;
        while(i < m && j < n) {
            if (A[i] < B[j]) {
                tmp[pos++] = A[i++];
            } else {
                tmp[pos++] = B[j++];
            }
        }

        //之后看谁没结束
        while(i < m) {
            tmp[pos++] = A[i++];
        }
        while(j < n) {
            tmp[pos++] = B[j++];
        }

        for (int k = 0; k < tmp.length; k++) {
            A[k] = tmp[k];
        }

    }
}
